单斜氧化锆表面水合和脱水的动态模拟

常用的氧化物负载金属催化剂通常在水相中制备，且在使用前常常需要经过煅烧. 因此，氧化物载体表面的水合和脱水过程对于负载型金属催化剂的真实建模至关重要. 通过第一性原理分子动力学模拟，本文考察了温和温度下无水单斜氧化锆(111)表面在显式溶剂水中的演化. 在模拟过程中，所有的双重配位桥位氧位点很快被溶剂水质子化，形成酸性羟基(HO_L)，并在锆原子上留下碱性羟基(HO^*). 这些碱性羟基(HO^*)可以与表面未解离的吸附水分子(H₂O^*$)进行活跃的质子交换，进而在表面自由扩散. 在273 K到373 K的温度范围下，第一性原理分子动力学水相模拟可以得到一种较为确定的、有代表性的平衡水合单斜氧化锆(111)表面，其表面锆原子上覆盖度(θ)为0.75. 随后，为了模拟低于800 K的温和煅烧温度下的表面脱水过程，本文使用密度泛函理论计算了表面水分子的逐步脱附自由能. 通过获得表面的脱水相图，总结了不同煅烧温度下有代表性的、部分水合的单斜氧化锆(111)表面(0.25≤θ<0.75). 这些水合单斜氧化锆(111)表面具有重要的理论意义，可以方便快捷地被应用于氧化锆催化剂及氧化锆负载金属催化剂的真实建模与模拟.     

Stability of Multiplier Ideal Sheaves

Chinese Annals of Mathematics, Series B - In the present article, the authors find and establish stability of multiplier ideal sheaves, which is more general than strong openness.     

On the metabolites produced by Colletotrichum gloeosporioides a fungus proposed for the Ambrosia artemisiifolia biocontrol; spectroscopic data and absolute configuration assignment of colletochlorin A

Ambrosia artemisiifolia L. is responsible for serious allergies induced on humans. Different approaches for its control were proposed during the COST Action FA1203 “Sustainable management of Ambrosia artemisiifolia in Europe” (SMARTER). Fungal secondary metabolites often show potential herbicidal activity. Three phytotoxins were purified from the fungal culture filtrates of Colletotrichum gloeosporioides, isolated from infected leaves of A. artemisiifolia. They were identified by spectroscopic and chemical methods as colletochlorin A, orcinol and tyrosol (1, 2 and 3). The absolute configuration 6’R to colletochlorin A was assigned for the first time applying the advanced Mosher’s method. When assayed by leaf-puncture on A. artemisiifolia only 1 caused the appearance of large necrosis. The same symptoms were also induced by 1 on ambrosia plantlets associated with plant wilting. On Lemna minor, colletochlorin A caused a clear fronds browning, with a total reduction in chlorophyll content.     

On the Lipschitz equivalence of self‐affine sets

Recently Lipschitz equivalence of self‐similar sets on has been studied extensively in the literature. However for self‐affine sets the problem is more awkward and there are very few results. In this paper, we introduce a w‐Lipschitz equivalence by repacing the Euclidean norm with a pseudo‐norm w. Under the open set condition, we prove that any two totally disconnected integral self‐affine sets with a common matrix are w‐Lipschitz equivalent if and only if their digit sets have equal cardinality. The main methods used are the technique of pseudo‐norm and Gromov hyperbolic graph theory on iterated function systems.     

Mixing time of an unaligned Gibbs sampler on the square

The paper concerns a particular example of the Gibbs sampler and its mixing efficiency. Coordinates of a point are rerandomized in the unit square ${[0,1]}^2$ to approach a stationary distribution with density proportional to $exp(?A^2{(u?v)}^2)$ for $(u,v)\in {[0,1]}^2$ with some large parameter $A$.Diaconis conjectured the mixing time of this process to be $O\left(A^2\right)$ which we confirm in this paper. This improves on the currently known $O(exp\left(A^2\right))$ estimate.     

Clique-cutsets beyond chordal graphs

Truemper configurations (thetas, pyramids, prisms, and wheels) have played an important role in the study of complex hereditary graph classes (eg, the class of perfect graphs and the class of even-hole-free graphs), appearing both as excluded configurations, and as configurations around which graphs can be decomposed. In this paper, we study the structure of graphs that contain (as induced subgraphs) no Truemper configurations other than (possibly) universal wheels and twin wheels. We also study several subclasses of this class. We use our structural results to analyze the complexity of the recognition, maximum weight clique, maximum weight stable set, and optimal vertex coloring problems for these classes. Furthermore, we obtain polynomial -bounding functions for these classes.     

Colourings of cubic graphs inducing isomorphic monochromatic subgraphs

A -bisection of a bridgeless cubic graph is a -colouring of its vertex set such that the colour classes have the same cardinality and all connected components in the two subgraphs induced by the colour classes ( monochromatic components in what follows) have order at most . Ban and Linial Conjectured that every bridgeless cubic graph admits a -bisection except for the Petersen graph. A similar problem for the edge set of cubic graphs has been studied: Wormald conjectured that every cubic graph with has a -edge colouring such that the two monochromatic subgraphs are isomorphic linear forests (ie, a forest whose components are paths). Finally, Ando conjectured that every cubic graph admits a bisection such that the two induced monochromatic subgraphs are isomorphic. In this paper, we provide evidence of a strong relation of the conjectures of Ban-Linial and Wormald with Ando's Conjecture. Furthermore, we also give computational and theoretical evidence in their support. As a result, we pose some open problems stronger than the above-mentioned conjectures. Moreover, we prove Ban-Linial's Conjecture for cubic-cycle permutation graphs. As a by-product of studying -edge colourings of cubic graphs having linear forests as monochromatic components, we also give a negative answer to a problem posed by Jackson and Wormald about certain decompositions of cubic graphs into linear forests.     

Isomorphisms of spaces with large distortion

Let K and S be locally compact Hausdorff spaces and let X be a strictly convex Banach space of finite dimension at least 2. In this paper, we prove that if there exists an isomorphism T from onto satisfying then K and S are homeomorphic. Here denotes the Schäffer constant of X. Even for the classical cases , and , this result is the X‐valued Banach–Stone theorem via isomorphism with the largest distortion that is known so far, namely . On the other hand, it is well known that this result is not true for , even though K and S are compact Hausdorff spaces.